Residuated frames with applications to decidability
نویسندگان
چکیده
منابع مشابه
Residuated Frames with Applications to Decidability
Residuated frames provide relational semantics for substructural logics and are a natural generalization of Kripke frames in intuitionistic and modal logic, and of phase spaces in linear logic. We explore the connection between Gentzen systems and residuated frames and illustrate how frames provide a uniform treatment for semantic proofs of cut-elimination, the finite model property and the fin...
متن کاملA Gentzen System and Decidability for Residuated Lattices
This note presents details of a result of Okada and Terui[2] which shows that the equational theory of residuated lattices is decidable and gives an effective algorithm based on a Gentzen system for propositional intuitionistic linear logic. The variety of residuated lattices is denoted by RL. An algebra (L,∨,∧, ∗, \, /, 1) is a member of this variety if (L,∨,∧) is a lattice, (L, ∗, 1) is a mon...
متن کاملResiduated Basic Logic II. Interpolation, Decidability and Embedding
We prove that the sequent calculus LRBL for residuated basic logic RBL has strong finite model property, and that intuitionistic logic can be embedded into basic propositional logic BPL. Thus RBL is decidable. Moreover, it follows that the class of residuated basic algebras has the finite embeddability property, and that BPL is PSPACE-complete, and that intuitionistic logic can be embedded into...
متن کاملPossibilistic Residuated Implication Logics with Applications
In this paper, we will develop a class of logics for reasoning about qualitative and quantitative uncertainty. The semantics of the logics is uniformly based on possibility theory. Each logic in the class is parameterized by a t-norm operation on [0,1], and we express the degree of implication between the possibilities of two formulas explicitly by using residuated implication with respect to t...
متن کاملDistributive residuated frames and generalized bunched implication algebras
We show that all extensions of the (non-associative) Gentzen system for distributive full Lambek calculus by simple structural rules have the cut elimination property. Also, extensions by such rules that do not increase complexity have the finite model property, hence many subvarieties of the variety of distributive residuated lattices have decidable equational theories. For some other extensio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2012
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-2012-05573-5